New Tools and Connections for Exponential-Time Approximation
نویسندگان
چکیده
منابع مشابه
New Tools and Connections for Exponential-time Approximation
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter α > 1, and the goal is to design an α-approximation algorithm with the fastest possible running time. We show the following results: 1. An r-approximation for maximum independent set in O∗(exp(Õ(n/r log2 r + r log2 r))) time, 2. An r-approximat...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولModerate exponential time approximation and branching algorithms
We study links between approximation, exponential time computation and fixed parameter tractability. In particular, rather than focusing on one particular optimization problem, we tackle the question of finding sufficient conditions for a problem to admit “good” approximation algorithms in exponential time. In particular, we focus on the existence of “approximation schemata” (ratios 1 ± ǫ for a...
متن کاملExponential-Time Approximation of Hard Problems
We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. Specifically, we focus on MAXIMUM INDEPENDENT SET, VERTEX COLORING, SET COVER, and BANDWIDTH. In recent years, many researchers design exact exponential-time algorithms for these and other hard problems. Th...
متن کاملExponential-time approximation of weighted set cover
The Set Cover problem belongs to a group of hard problems which are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. In recent years, many researchers design exact exponential-time algorithms for problems of that kind. The goal is getting the time complexity still of order O(c), but with the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0512-8